On the Completeness of Minimal Sufficient Statistics with Censored Observations
نویسندگان
چکیده
منابع مشابه
Algorithmic Minimal Sufficient Statistics: a New Definition
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which has better properties.
متن کاملazerbaijans political development after the collapse of soviet union and implication on relation with the islamic republic of iran
در فصل اول این پایاین نامه در خصوص تاریخ کشور اذربایجان قبل و بعد از جدایی این کشور از ایران مورد بررسی قرار گرفته است ودر فصل دوم تحولات سیاسی این کشور بعد از 1991 و در واقع بعد از فروپاشی شوروی و دولتهایی که روی کار امدند در از جمله دولت ابولفضل ایلچی بیگ،دولت حیدر علی اف وبعد از او پسرش الهام علی اف و نگرش هرکدام از این دولتها به سیاسیت خارجی اذربایجان مورد اشاره قرار گرفته است.در ودر فصل سو...
Progressive Type II censored order statistics for multivariate observations
For a sequence of independent and identically distributed random vectorsXi = (X1 i , X2 i , . . . , X i ), i = 1, 2, . . . , n, we consider the conditional ordering of these random vectors with respect to the magnitudes of N(Xi ), i = 1, 2, . . . , n, where N is a p-variate continuous function defined on the support set of X1 and satisfying certain regularity conditions. We also consider the Pr...
متن کاملOn the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence
It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computable function, has a length larger than the computational depth of x, and can solve the Halting problem for all programs with length shorter than the m-depth of x. It is also shown that there are strings for which the al...
متن کاملSufficient Completeness Checking with Propositional Tree Automata
Su cient completeness means that enough equations have been speci ed, so that the functions of an equational speci cation are fully de ned on all relevant data. This is important for both debugging and formal reasoning. In this work we extend su cient completeness methods to handle expressive speci cations involving: (i) partiality; (ii) conditional equations; and (iii) deductionmodulo axioms. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1977
ISSN: 0090-5364
DOI: 10.1214/aos/1176343854